Adapting to Unknown Smoothness via Wavelet Shrinkage
نویسندگان
چکیده
We attempt to recover a function of unknown smoothness from noisy, sampled data. We introduce a procedure, SureShrink, which suppresses noise by thresholding the empirical wavelet coe cients. The thresholding is adaptive: a threshold level is assigned to each dyadic resolution level by the principle of minimizing the Stein Unbiased Estimate of Risk (Sure) for threshold estimates. The computational e ort of the overall procedure is order N log(N) as a function of the sample size N . SureShrink is smoothness-adaptive: if the unknown function contains jumps, the reconstruction (essentially) does also; if the unknown function has a smooth piece, the reconstruction is (essentially) as smooth as the mother wavelet will allow. The procedure is in a sense optimally smoothness-adaptive: it is near-minimax simultaneously over a whole interval of the Besov scale; the size of this interval depends on the choice of mother wavelet. We know from a previous paper by the authors that traditional smoothing methods { kernels, splines, and orthogonal series estimates { even with optimal choices of the smoothing parameter, would be unable to perform in a near-minimax way over many spaces in the Besov scale. Examples of SureShrink are given: the advantages of the method are particularly evident when the underlying function has jump discontinuities on a smooth background.
منابع مشابه
Minimax Estimation via Wavelet Shrinkage
We attempt to recover an unknown function from noisy, sampled data. Using orthonormal bases of compactly supported wavelets we develop a nonlinear method which works in the wavelet domain by simple nonlinear shrinkage of the empirical wavelet coe cients. The shrinkage can be tuned to be nearly minimax over any member of a wide range of Triebeland Besov-type smoothness constraints, and asymptoti...
متن کاملAdapting to Unknown Smoothness by Aggregation of Thresholded Wavelet Estimators
We study the performances of an adaptive procedure based on a convex combination, with data-driven weights, of term-by-term thresholded wavelet estimators. For the bounded regression model, with random uniform design, and the nonparametric density model, we show that the resulting estimator is optimal in the minimax sense over all Besov balls under the L2 risk, without any logarithm factor.
متن کاملFast cross-validatory choice of wavelet smoothness, primary resolution and threshold in wavelet shrinkage using the Kovac-Silverman algorithm
This article introduces a fast cross-validation algorithm that performs wavelet shrinkage on data sets of arbitrary size and design and also simultaneously selects good values of the primary resolution and number of vanishing moments. We demonstrate the utility of our method by suggesting alternative estimates of the conditional mean of the well-known Ethanol data set. Our alternative estimates...
متن کاملChoice of wavelet smoothness, primary resolution and threshold in wavelet shrinkage
This article introduces a fast cross-validation algorithm that performs wavelet shrinkage on data sets of arbitrary size and irregular design and also simultaneously selects good values of the primary resolution and number of vanishing moments. We demonstrate the utility of our method by suggesting alternative estimates of the conditional mean of the well-known Ethanol data set. Our alternative...
متن کاملWavelet Bayesian Block Shrinkage via Mixtures of Normal-Inverse Gamma Priors
In this paper we propose a block shrinkage method in the wavelet domain for estimating an unknown function in the presence of Gaussian noise. This shrinkage utilizes an empirical Bayes, block-adaptive approach that accounts for the sparseness of the representation of the unknown function. The modeling is accomplished by using a mixture of two normal-inverse gamma distributions as a joint prior ...
متن کامل